runtime.timers.heap (field)

51 uses

	runtime (current package)
		proc.go#L6462: 		if len(pp.timers.heap) > 0 {
		proc.go#L6924: 			print(" runqsize=", t-h, " gfreecnt=", pp.gFree.size, " timerslen=", len(pp.timers.heap), "\n")
		time.go#L138: 	heap []timerWhen
		time.go#L194: 	ts.len.Store(uint32(len(ts.heap)))
		time.go#L291: 	if ts == nil || t != ts.heap[0].timer {
		time.go#L306: 		ts.heap[0].when = t.when
		time.go#L462: 	ts.heap = append(ts.heap, timerWhen{t, t.when})
		time.go#L463: 	ts.siftUp(len(ts.heap) - 1)
		time.go#L464: 	if t == ts.heap[0].timer {
		time.go#L547: 	t := ts.heap[0].timer
		time.go#L552: 	last := len(ts.heap) - 1
		time.go#L554: 		ts.heap[0] = ts.heap[last]
		time.go#L556: 	ts.heap[last] = timerWhen{}
		time.go#L557: 	ts.heap = ts.heap[:last]
		time.go#L775: 		if len(ts.heap) == 0 {
		time.go#L791: 		n := len(ts.heap)
		time.go#L792: 		if t := ts.heap[n-1].timer; t.astate.Load()&timerZombie != 0 {
		time.go#L798: 				ts.heap[n-1] = timerWhen{}
		time.go#L799: 				ts.heap = ts.heap[:n-1]
		time.go#L805: 		t := ts.heap[0].timer
		time.go#L833: 	if len(src.heap) > 0 {
		time.go#L837: 		for _, tw := range src.heap {
		time.go#L847: 		src.heap = nil
		time.go#L852: 		ts.len.Store(uint32(len(ts.heap)))
		time.go#L933: 	for i := 0; i < len(ts.heap); i++ {
		time.go#L934: 		tw := &ts.heap[i]
		time.go#L953: 			n := len(ts.heap)
		time.go#L954: 			ts.heap[i] = ts.heap[n-1]
		time.go#L955: 			ts.heap[n-1] = timerWhen{}
		time.go#L956: 			ts.heap = ts.heap[:n-1]
		time.go#L1038: 	if len(ts.heap) > 0 {
		time.go#L1040: 		for len(ts.heap) > 0 {
		time.go#L1078: 	if len(ts.heap) == 0 {
		time.go#L1081: 	tw := ts.heap[0]
		time.go#L1275: 	for i, tw := range ts.heap {
		time.go#L1283: 		if tw.less(ts.heap[p]) {
		time.go#L1284: 			print("bad timer heap at ", i, ": ", p, ": ", ts.heap[p].when, ", ", i, ": ", tw.when, "\n")
		time.go#L1288: 	if n := int(ts.len.Load()); len(ts.heap) != n {
		time.go#L1289: 		println("timer heap len", len(ts.heap), "!= atomic len", n)
		time.go#L1298: 	if len(ts.heap) == 0 {
		time.go#L1301: 		ts.minWhenHeap.Store(ts.heap[0].when)
		time.go#L1356: 	heap := ts.heap
		time.go#L1380: 	heap := ts.heap
		time.go#L1421: 	if len(ts.heap) <= 1 {
		time.go#L1424: 	for i := int(uint(len(ts.heap)-1-1) / timerHeapN); i >= 0; i-- {